Forbidden Triples Generating a Finite set of 3-Connected Graphs
نویسندگان
چکیده
منابع مشابه
Forbidden Triples Generating a Finite set of 3-Connected Graphs
For a graph G and a set F of connected graphs, G is said be F-free if G does not contain any member of F as an induced subgraph. We let G3(F) denote the set of all 3-connected F-free graphs. This paper is concerned with sets F of connected graphs such that |F| = 3 and G3(F) is finite. Among other results, we show that for an integer m > 3 and a connected graph T of order greater than or equal t...
متن کاملForbidden subgraphs generating a finite set
For a set F of connected graphs, a graph G is said to be F-free if G does not contain any member of F as an induced subgraph. The members of F are referred to as forbidden subgraphs. When we study the relationship between forbidden subgraphs and a certain graph property, we often allow the existence of exceptional graphs as long as their number is finite. However, in this type of research, if t...
متن کاملCharacterizing forbidden clawless triples implying hamiltonian graphs
In this paper we characterize those forbidden triples of graphs, no one of which is a generalized claw, su2cient to imply that a 2-connected graph of su2ciently large order is hamiltonian. c © 2002 Elsevier Science B.V. All rights reserved.
متن کاملForbidden triples implying Hamiltonicity: for all graphs
In [2], Brousek characterizes all triples of graphs, G1, G2, G3, with Gi = K1,3 for some i = 1, 2, or 3, such that all G1G2G3-free graphs contain a hamiltonian cycle. In [6], Faudree, Gould, Jacobson and Lesniak consider the problem of finding triples of graphs G1, G2, G3, none of which is a K1,s, s ≥ 3 such that G1, G2, G3-free graphs of sufficiently large order contain a hamiltonian cycle. In...
متن کاملOn the number of contractible triples in 3-connected graphs
McCuaig and Ota proved that every 3-connected graph G on at least 9 vertices admits a contractible triple, i. e. a connected subgraph H on three vertices such that G − V (H) is 2-connected. Here we show that every 3-connected graph G on at least 9 vertices has more than |V (G)|/10 many contractible triples. If, moreover, G is cubic, then there are at least |V (G)|/3 many contractible triples, w...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 2015
ISSN: 1077-8926
DOI: 10.37236/3255